Fiber Organizer

ABSTRACT

A method organizes fibers. A plurality of fibers is received into a first assembly. An initial sequence of the plurality of fibers in the first assembly is obtained. A set of key combinations is identified from the initial sequence and a predetermined sequence. A second assembly is slid across the first assembly. The set of key combinations is actuated to move the plurality of fibers from the first assembly to the second assembly and order the plurality of fibers in the second assembly in the predetermined sequence.

CROSS REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application63/038,405, filed Jun. 12, 2020, and U.S. Provisional Application63/092,067, filed Oct. 15, 2020, which are each incorporated byreference herein.

BACKGROUND

Before optical fibers are inserted into a connector, the optical fibersare organized so that the sequence of fibers within the connector areordered in accordance with a predetermined sequence. Using thepredetermined sequence ensures that an optical signal is transmittedthrough the proper optical fiber. A challenge is to automaticallyorganize randomly sequenced fibers into a predetermined sequence.

SUMMARY

In general, in one or more aspects, the disclosure relates to a methodthat organizes fibers. A plurality of fibers is received into a firstassembly. An initial sequence of the plurality of fibers in the firstassembly is obtained. A set of key combinations is identified from theinitial sequence and a predetermined sequence. A second assembly is slidacross the first assembly. The set of key combinations is actuated tomove the plurality of fibers from the first assembly to the secondassembly and order the plurality of fibers in the second assembly in thepredetermined sequence.

In general, in one or more aspects, the disclosure relates to a fibersorting system that includes a first assembly, a second assembly, acomputing system, and a control application. The control applicationexecutes on the computing system and configures the fiber sorting systemto obtain an initial sequence of a plurality of fibers in the firstassembly. A set of key combinations is identified from the initialsequence and a predetermined sequence. The second assembly is slidacross the first assembly. The set of key combinations is actuated tomove the plurality of fibers from the first assembly to the secondassembly and order the plurality of fibers in the second assembly in thepredetermined sequence.

In general, in one or more aspects, the disclosure relates to a fibersorting system that includes a first assembly, an insert, a plate of thefirst assembly that includes the insert, a second assembly, a computingsystem, and a control application. The control application executes onthe computing system. An initial sequence of a plurality of fibers inthe first assembly is obtained. A set of key combinations is identifiedfrom the initial sequence and a predetermined sequence. The secondassembly is slid across the first assembly. The set of key combinationsis actuated to move the plurality of fibers from the first assembly tothe second assembly and order the plurality of fibers in the secondassembly in the predetermined sequence. Movement of a key of the firstassembly is limited with the insert to the plate of the first assembly.

Other aspects of the invention will be apparent from the followingdescription and the appended claims.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1A, FIG. 1B, FIG. 1C, and FIG. 1D show diagrams of systems inaccordance with disclosed embodiments.

FIG. 2 shows a flowchart in accordance with disclosed embodiments.

FIG. 3A, FIG. 3B, FIG. 3C, FIG. 3D, FIG. 3E, FIG. 3F, FIG. 4A, FIG. 4B,FIG. 4C, FIG. 4D, FIG. 4E, FIG. 4F, FIG. 4G, FIG. 4H, FIG. 4I, FIG. 4J,FIG. 4K, FIG. 4L, FIG. 4M, and FIG. 4N show examples in accordance withdisclosed embodiments.

FIG. 5A and FIG. 5B show computing systems in accordance with disclosedembodiments.

DETAILED DESCRIPTION

Specific embodiments of the invention will now be described in detailwith reference to the accompanying figures. Like elements in the variousfigures are denoted by like reference numerals for consistency.

In the following detailed description of embodiments of the invention,numerous specific details are set forth in order to provide a morethorough understanding of the invention. However, it will be apparent toone of ordinary skill in the art that the invention may be practicedwithout these specific details. In other instances, well-known featureshave not been described in detail to avoid unnecessarily complicatingthe description.

Throughout the application, ordinal numbers (e.g., first, second, third,etc.) may be used as an adjective for an element (i.e., any noun in theapplication). The use of ordinal numbers is not to imply or create anyparticular ordering of the elements nor to limit any element to beingonly a single element unless expressly disclosed, such as by the use ofthe terms “before”, “after”, “single”, and other such terminology.Rather, the use of ordinal numbers is to distinguish between theelements. By way of an example, a first element is distinct from asecond element, and the first element may encompass more than oneelement and succeed (or precede) the second element in an ordering ofelements.

The present disclosure relates to fiber optic cable manufacturing,generally, and more specifically, to a system and method for organizingfiber optic cables.

In general, embodiments of the disclosure automatically organize opticalfibers from a random sequence to a predetermined. Automaticallyorganizing the optical fibers reduces the amount of time taken toconstruct an optical cable that includes multiple optical fibers.

Optical fibers are used in communications for transmission over longerdistances and higher data rates than electrical cables, exhibit lesstransmission loss and are not subject to electromagnetic interference.Optical fibers include a core surrounded by a cladding material. Thefibers may be manufactured as single fibers and may be fabricated withmultiple fibers in a ribbon referred to as a ribbon fiber. A coating maybe present over the cladding and a cable jacket, which may comprise aplastic/polymer material over the coating enclosing the fiber opticcable assembly. The use of ribbons allows for increased density oftransmission media above that available with single fiber cables.

Joining optical fibers with low loss is a complex and high precisionprocess. Joining optical fibers requires careful and precise cleaving ofthe fibers, alignment of the fiber cores, and coupling of the cores. Oneway in which the fibers are connected to end use equipment is by the useof connectors.

Fiber optic cables can have a range of connector types, including amulti-fiber push on (MPO) connector, referred to as an MPO. An MPO mayprovide 8 to 32 fiber connections in a space of about 0.1×0.25 inches.

MPO-based fiber cables provide higher value to fiber cablemanufacturers. For example, a 144-fiber cable, which is a popular andhigh value industry configuration, may include twelve MPO-12 connectorsat one end with each MPO-12 connector handling twelve fibers. Such acable supports high density, high fiber count requirements emerging inthe industry, such as high density data centers and 5G networks.

For MPO terminations, delicate, intricate, and very small form factoroperations are used. The termination process may include preparing theribbon fiber for stripping and stripping the fiber. The stripped ribbonfiber is then cleaned and cleaved to prepare the ends of the opticalfibers.

The prepared fibers are then organized and inserted into the MPOconnector ferrule. The small size and form factor of the ferrule may beabout 0.1×0.25 inches in size. The ribbon fiber is then inserted intothe MPO ferrule and checked for proper alignment.

An adhesive is then applied to the fiber in the ferrule to pot theribbon fibers in place. The application of adhesive may be automatedthrough use of an adhesive dispensing system. The ribbon fiber with theferrule is then placed in a curing fixture and positioned in a curingoven.

Once the adhesive is cured, the ribbon fiber with the ferrule (referredto as the ribbon assembly) is loaded into a laser cleaver to cleave theends of the fibers beyond the end of the ferrule.

Following cleaving, the ribbon fiber is loaded into a polisher andextensively polished. The ribbon fiber (assembly) is then tested, andthen the cable is ready for further fabrication.

Accordingly, there is a need for an automated system and method forterminating fiber optic cables, and specifically, ferrules to opticalfibers and fiber ribbons. Desirably, such a system and method areefficient and produce a high quality, repeatable termination withsavings in time and cost. More desirably still, such a system and methodmay be transportable so that custom size (length) cables can bemanufactured as needed, and may be fabricated locally, to suit therequirements of the end user.

FIGS. 1A, 1B, 1C, and 1D show diagrams of systems that are in accordancewith the disclosure. FIG. 1A shows the fiber organizing system (100).FIG. 1B shows the plate assembly B (110). FIG. 1C shows the computingsystem (106).

FIG. 1D shows the machine learning model (145). The embodiments of FIGS.1A, 1B, 1C, and 1D may be combined and may include or be included withinthe features and embodiments described in the other figures of theapplication. The features and elements of FIGS. 1A, 1B, 1C, and 1D are,individually and as a combination, improvements to fiber organizertechnology and computing systems. The various elements, systems, andcomponents shown in FIGS. 1A, 1B, 1C, and 1D may be omitted, repeated,combined, and/or altered as shown from FIGS. 1A, 1B, 1C, and 1D.Accordingly, the scope of the present disclosure should not beconsidered limited to the specific arrangements shown in FIGS. 1A, 1B,1C, and 1D.

Turning to FIG. 1A, the fiber organizer system (100) organizes thefibers (102) from an initial sequence to a predetermined sequence. Thefiber organizer system (100) receives the fibers (102), which may be ina random initial sequence, and reorders the fibers (102) into apredetermined sequence.

The fibers (102) are optical fibers configured to propagate opticalsignals. In one embodiment, the fibers (102) may be coded with differentcolors and patterns to uniquely distinguish and identify the differentindividual fibers that make up the fibers (102).

The sensor system (104) is a part of the fiber organizer system (100)that monitors the fibers (102). In one embodiment, the sensor system(104) includes a camera that images the fibers (102), a mirror to imagethe fibers (102), and a set of light sources (e.g., light emittingdiodes) to illuminate the fibers (102).

The computing system (106) is a collection of computing devices thatcontrol the fiber organizer system (100). The computing system (106) mayinclude an embedded computer (connected to the sensor system (104) andthe actuators A (120), B (114), and C (108)), a personal computer(connected to the embedded computer), a server computer (connected tothe personal computer), etc. The computing system (106) receives datafrom the sensor system (104), which is used to control the actuators A(120), B (114), and C (108). The computing system (106) may includeembodiments of the computing system (500) of FIG. 5A.

The actuator C (108) is a component that moves the plate assembly B(110) relative to the plate assembly A (116). In one embodiment, theactuator C (108) includes a stepper motor that makes precision movementsthat are less than the diameter of the fibers (102).

The plate assembly B (110) is a collection of components, including theplate B (111), that are moved by the actuator C (108) with respect tothe plate assembly A (116). The plate assembly B (110) includes theplate B (111) and the connector (115).

The connector (115) connects the plate B (111) to the actuator C (108).The connector (115) may include a hinge to open the fiber sorting system(100) for entry of the fibers (102) between the plate assembly B (110)and the plate assembly A (116).

The plate B (111) is a component to which the key assembly B (112) andthe actuators B (114) are mounted. The plate B (111) is positionedadjacent to the plate A (117).

The key assembly B (112) is a collection of components that include andaffix the keys B (113) to the plate B (111). In one embodiment, the keyassembly B (112) is structured for the keys B (113) to rotate and movethe fibers (102) between the plate assemblies A (116) and B (110).

The keys B (113) manipulate the fibers (102), in conjunction with thekeys A (119), to move the fibers (102). In one embodiment, after thefibers (102) are initially placed within the plate assembly A (116), thefibers are moved out of the plate assembly A (116) and into the plateassembly B (110). Each of the keys B (113) are coupled to and moved bythe actuators B (114). In one embodiment, a width of one of the keys B(113) (referred to as a key width) is about equal to a diameter of oneof the fibers (120). For example, the key width may be 0.010 inches(0.250 millimeters) for a fiber with a fiber diameter of 250 microns(0.0098 inches). Different key widths may be used for different fiberwidths.

The actuators B (114) are components that move the keys B (113). In oneembodiment, the actuators B (114) include a solenoid or pneumaticcylinder for each of the keys B (113).

The plate assembly A (116) is a collection of components, including theplate A (117), that may remain stationary with respect to the plateassembly A (116). The plate assembly A (116) includes the plate A (117).

The plate A (117) is a component to which the key assembly A (118) andthe actuators A (120) are mounted. The plate A (117) is positionedadjacent to the plate B (111).

The key assembly A (118) is a collection of components that include andaffix the keys A (119) to the plate A (117). In one embodiment, the keyassembly A (118) is structured for the keys A (119) to rotate and movethe fibers (102) between the plate assemblies A (116) and B (110).

In one embodiment, the fibers (102) are placed into the plate assembly A(116) in the initial sequence (in a random order). The fibers (102) arethen moved from the plate assembly A (116) to the plate assembly B (110)and positioned into a subsequent sequence that matches the predeterminedsequence. Alternatively, the fibers (102) may be initially received bythe plate assembly B (110) (positioned in the initial random sequence)and then moved to the plate assembly A (116) (positioned in thepredefined sequence). In one embodiment, after the fibers (120) areorganized into the predetermined sequence, the fibers (120) may be movedback to the plate assembly that initially received the fibers (120).

The keys A (119) manipulate the fibers (102), in conjunction with thekeys B (113), to move the fibers (102) from the plate assembly A (116)to the plate assembly B (110). Each of the keys A (119) are coupled toand moved by the actuators A (120).

The actuators A (120) are components that move the keys A (119). In oneembodiment, the actuators A (120) include a solenoid or pneumaticcylinder for each of the keys A (119).

Turning to FIG. 1B, an embodiment of the plate assembly B (110) isfurther described. The plate B (111), of the plate assembly B (110),includes the insert (123). The insert (123) may be formed to moreprecise tolerances than the plate B (111). For example, the insert (123)may be formed with tolerances of about ±0.005 millimeters and the platemay be formed with tolerances of about ±0.02 millimeters. The insert(123) includes the insert surfaces A (124) and B (125). The insertsurfaces A (124) and B (125) limit the movement of the key (127) incombination with the key surfaces A (128) and B (129).

The key (127) is one of the keys B (113) (of FIG. 1A). The key (127)includes the key surfaces A (128) and B (129). The key surfaces A (128)and B (129), in conjunction with the insert surfaces A (124) and B(125), limit the movement of the key (127).

The key (127) includes multiple holes, including the pivot hole (131),the actuator hole (133) and the pass through holes (136). The pivot hole(131) is the hole about which the key (127) pivots or rotates.

The actuator hole (133) is the hole through which the key (127) isconnected to one of the actuators B (114) (of FIG. 1A). In oneembodiment, the connection from one of the actuators B (114) (of FIG.1A) to the key (127) may be formed with a rocker arm.

The pass through holes (135), including the pass through hole (136), arethe holes through which connectors between the other keys (of the keys B(113) of FIG. 1A) and the other actuators B (114) (of FIG. 1A) pass. Thepass through holes (135) are configured to allow the other connectorsthrough the key (127) without transferring forces from the otherconnectors and actuators B (114) (of FIG. 1A) to the key (127). The passthrough holes (135) isolate the key (127) from the movements of theconnectors for the other keys in the key assembly B (112).

Turning to FIG. 1C, an embodiment of the computing system (106) isfurther described. The computing system (106) controls the fiberorganizer system (100) (of FIG. 1A) using multiple software components.The software components include the control application (142) and thetraining application (147).

The control application (142) is a software component of the fiberorganizer system (100). The control application (142) may be stored inmemory of the computing system (106) and execute on processors of thecomputing system (106). The control application (142) includes themachine learning model (145).

The machine learning model (145) is a software of the fiber organizersystem (100). In one embodiment, the machine learning model (145)generates predictions of labels for the fibers (102) (of FIG. 1A) afterthe fibers (102) are organized.

The training application (147) is a software of the fiber organizersystem (100). The training application (147) trains the machine learningmodel (145). The training application (147) trains the machine learningmodel using the update function (148), which is another softwarecomponent of the fiber organizer system (100).

Turning to FIG. 1D, an embodiment of the machine learning model (145) isfurther described. The machine learning model (145) may be used tocontrol parameters of the fiber organizer system (100) (of FIG. 1A). Themachine learning model (145) may be a neural network that includes theinput layer (152), the hidden layer (160), and the output layer (168).Other types, architectures, and structures of machine learning modelsmay be used, including recurrent neural networks, convolutional neuralnetworks, state vector machines, logistic regression, etc. Data is inputto the input layer (152) which passes through the hidden layer (160) tothe output layer (168) to generate a final output, the prediction (169).The prediction (169) may be a prediction of whether the fibers are inthe correct order based on the data entered in the input layer (152).

The input layer (152) receives the inputs to the machine learning model(145). In one embodiment, the input layer (152) receives the carriagespeed (155), the key speed (156), the initial fiber position (157), andthe number of machine cycles (158). In one embodiment, the carriagespeed (155) is the speed of the plate B (111) relative to the plate A(117). The key speed (156) is the speed for the movement of the keys A(119) and B (113). The initial fiber position (157) identifies theinitial sequence of fibers to be organized by the system (100) (of FIG.1A). The number of machine cycles identifies the number of times thatthe fiber organizing system (100) (of FIG. 1A) has organized a set offibers.

The hidden layer (160) is a layer of the machine learning model (145).The hidden layer (160) includes the nodes A (162), B (163), through N(165) that receive the inputs (155) through (158) from the input layer.In one embodiment, the input layer (160) is fully connected to the inputlayer (152) with each of the nodes A (162) through N (165) correspondingto a weighted sum of the inputs (155) through (158) from the input layer(152).

The output layer (168) is a layer of the machine learning model (145).The output layer includes the prediction (169). In one embodiment, theoutput layer (168) is fully connected to the hidden layer (160) with theprediction (169) corresponding to a weighted sum of the outputs from thenodes A (162) through N (165) of the hidden layer (160). In oneembodiment, the prediction (169) identifies a probability that asequence of fibers is reorganized to match the predetermined sequencewhen the carriage speed (155), the key speed (156), the initial fiberposition (157), and the machine cycles (158) are used.

During training, the prediction (169) from the output layer (168) may becompared with the label (172) with the update function (148). In oneembodiment, the label (172) is a binary value with a value of “1”indicating that the subsequent sequence matches the predeterminedsequence and a value of “0” indicating that the subsequent sequence doesnot match the predetermined sequence.

The error from the comparison of the prediction (196) to the label (172)may be backpropagated into the machine learning model (145) to improvethe accuracy of the machine learning model (145). For example, theupdate function (148) may backpropagate the error from the comparison tothe weights used by the hidden layer (160) and the output layer (168).

FIG. 2 is a flowchart of the process (200). The embodiments of FIG. 2may be combined and may include or be included within the features andembodiments described in the other figures of the application. Thefeatures of FIG. 2 are, individually and as an ordered combination,improvements to fiber organizer technology and computing systems. Whilethe various steps in the flowcharts are presented and describedsequentially, one of ordinary skill will appreciate that at least someof the steps may be executed in different orders, may be combined oromitted, and at least some of the steps may be executed in parallel.Furthermore, the steps may be performed actively or passively. Forexample, some steps may be performed using polling or be interruptdriven. By way of an example, determination steps may not have aprocessor process an instruction unless an interrupt is received tosignify that condition exists. As another example, determinations may beperformed by performing a test, such as checking a data value to testwhether the value is consistent with the tested condition.

Continuing with FIG. 2, the process (200) implements organizes fibers.The process (200) is performed by a fiber organizer system that includesa computing system.

At Step 202, fibers are received into a first assembly (e.g., a firstplate assembly or key assembly). Reception of the fibers may include theprocess of automatically opening the fiber organizer system, insertingthe fibers into an assembly (forming a random sequence of the fibers),and closing the fiber organizer system with the fibers in key assembly.For each step, the fiber organizer system may include sensors thatindicate the process through each step.

At Step 204, an initial sequence of the fibers in the first assembly isobtained. The initial sequence may be obtained by the sensor system ofthe fiber organizer system.

In one embodiment, the fibers extend from the first assembly and areimaged with a camera system of the sensor system. The camera systemgenerates an initial image that captures the initial sequence of thefibers. For example, the computing system may identify the position ofeach fiber from the initial image and identify a code from a color (red,yellow, green, white, etc.) or pattern (e.g., striped) on the fibers.

At Step 206, a set of key combinations is identified from the initialsequence and a predetermined sequence. In one embodiment, the computingsystem of the fiber organizer system processes the initial image toidentify the set of key combinations. The key combinations organize thefibers from the initial sequence to the predetermined sequence.

In one embodiment, a key combination includes a first key from the firstkey assembly and a second key from the second key assembly. The firstkey corresponds to a position of a fiber the initial sequence and thesecond key corresponds to a position of the fiber in the predeterminedsequence.

At Step 208, a second assembly is slid across the first assembly. Thesecond assembly is slid with respect to the first assembly at a carriagespeed. The sliding motion may be produced by applying a force to one orboth of the plate assemblies to which the key assembles are mounted. Thesliding may be continuous. In one embodiment, the sliding may stop andstart each time a fiber (or group of fibers) is transferred from oneassembly to the other assembly.

At Step 210, the set of key combinations are actuated to move the fibersfrom the first assembly to the second assembly and order the pluralityof fibers in the second assembly in the predetermined sequence. Theactuation may be performed contemporaneously with the sliding.

In one embodiment, actuating the key combination moves a fiber from thefirst assembly to the second assembly and places the fiber into thesecond assembly in accordance with the predetermined sequence. The keycombination may include the keys for multiple fibers.

In one embodiment, when two keys on opposite sides of a fiber areactivated to move the fiber, movement of the leading key may betriggered before movement of the trailing key is triggered. The leadingkey is the key in the subsequent position to where the fiber will bemoved. The trailing key is the key that is pushing the fiber from theinitial position into the subsequent position. The leading key istriggered to move a few milliseconds before the trailing key. In oneembodiment, the leading key is triggered about 20 to 80 millisecondsbefore the trailing key. The trailing key pushes the fiber into thesubsequent position. Triggering the leading key before the trailing keycreates a proper movement of the fiber from the initial position in thefirst assembly to the subsequent position in the second assembly andprevent the fiber from being miss-located.

In one embodiment, the actuating is based on a position of the firstassembly with respect to the second assembly. When the first assemblyand the second assembly are aligned with a first key (corresponding to afiber in the initial sequence), the fiber, and a second key(corresponding to the fiber in the predetermined sequence), the keycombination is triggered.

In one embodiment, movement of a key, of an assembly, is limited with aninsert to a plate of a plate assembly. Movement of the key may bestopped when a surface of the key contacts a surface of the insert.

In one embodiment, the plurality of fibers extending from the secondassembly is imaged, after sliding the second assembly, to generate asubsequent image. The subsequent image captures the positions of thefibers in the second assembly. A subsequent sequence of the plurality offibers may be determined from the subsequent image. The subsequentsequence may then be verified with the predetermined sequence using thesubsequent image. When the order of the fibers in the subsequentsequence is the same as the order of the fibers in the predeterminedsequence, the sequences are matched and verified.

In one embodiment, a machine learning model is trained to generate aprediction of a training order of training fibers in response to atraining carriage speed, a training key speed, a training fiber order,and a training cycle time. The prediction identifies the probabilitythat the subsequent sequence of the fibers in the second assemblymatches with the predetermined sequence for the fibers.

In one embodiment, a carriage speed for the sliding and a key speed forthe actuating is selected using the machine learning model, the initialsequence, and a number of machine cycles. The machine learning model maybe used to generate multiple predictions from different carriage speedsand key speeds. The prediction corresponding to the highest carriage andkey speeds while also meeting a minimum threshold probability (e.g., a99% probability) may be selected. The carriage and key speeds from theselected prediction may then be used to slide the key assemblies andactuate the key combinations.

FIGS. 3A-3F and 4A-4N show examples of systems and sequences thatorganize fibers. FIGS. 3A-3F show the fiber organizer system (300).FIGS. 4A-4N show a sequence of organizing fibers. The embodiments shownin FIGS. 3A-3F and 4A-4N may be combined and may include or be includedwithin the features and embodiments described in the other figures ofthe application. The features and elements of FIGS. 3A-3F and 4A-4N are,individually and as a combination, improvements to fiber organizertechnology and systems. The various features, elements, widgets,components, and interfaces shown in FIGS. 3A-3F and 4A-4N may beomitted, repeated, combined, and/or altered as shown. Accordingly, thescope of the present disclosure should not be considered limited to thespecific arrangements shown in FIGS. 3A-3F and 4A-4N.

Turning to FIG. 3A, a perspective view of the fiber organizer system(300) is illustrated. The fiber organizer system (300) organizes fibers(not shown) from an initial sequence to a predetermined sequence. Thefiber organizer system (300) includes the sensor system (302), theactuator system (320), and the fiber manipulation system (330).

The sensor system (302) obtains the initial and subsequent sequences ofthe fibers that are organized by the fiber organizer system (300). Thesensor system (302) includes the camera system (304) and the light block(306).

The camera system (302) includes the camera (308) and the lens (310).The lens (310) focuses the light from the fibers onto the sensor of thecamera (308). The camera (308) includes a sensor that converts the lightto electrical signals that are recorded and processed to generate imagesof the fibers.

The light block (306) generates and conditions the light used by thesensor system (302) to capture images of the fibers. The light block(306) includes the mirror (312), the first row of light emitting diodes(LEDs) (314), the second row of LEDs (316), and the protrusion (318).

The mirror (312) is a first surface mirror. The mirror (312) reflectslight from the fibers into the lens (310) of the camera system (304).

The first and second rows of LEDs (314) and (316) provide light thatreflects off the fibers and onto the mirror (312). The first row of LEDs(314) is behind the protrusion (318) to prevent light from the first rowof LEDs (314) from directly entering the camera system (304).

The actuator system (320) slides the upper and lower key assemblies(336) and (346) of the fiber organizer system (300) with respect to eachother. The actuator system (320) includes the motor (322) and theconnector (324).

The motor (322) pushes and pulls the upper plate assembly (332) to slidethe upper key assembly (336). The motor (322) is connected to the upperplate assembly (332) through the connector (324).

The connector (324) connects the motor (322) to the upper plate assembly(332). The connector (324) includes the connector plate (326) and thehinge (328). The connector plate (326) connects between the motor (322)and the hinge (328) to transfer the forces from the motor (322) to theupper plate assembly (332).

The hinge (328) connects between the connector plate (326) and the upperplate assembly (332) of the upper plate assembly (332). The hinge (328)provides a pivot point to open and close the fiber organizer system(300) by rotating the upper plate assembly (332) with respect to lowerplate assembly (344).

The fiber manipulation system (330) manipulates the fibers to organizethe fibers from an initial sequence to a subsequent sequence thatmatches a predetermined sequence. The fiber manipulation system (330)includes the upper plate assembly (332) and the lower plate assembly(344).

The upper plate assembly (332) is an assembly of components used tomanipulate the fibers. The upper plate assembly (332) opens by rotatingup about the pivot point of the hinge (328). The upper plate assembly(332) includes the upper plate (334), the upper key assembly (336), theupper connector arms (340), the upper actuators (342), and the handle(344).

The upper plate (334) is a rigid structure to which the components ofthe upper plate assembly are attached, including the upper key assembly(336). The upper plate (334) is attached to the connector (324) throughthe hinge (328).

The upper key assembly (336) includes the upper keys (338). The upperkeys (338) are connected through the upper connector arms (340) to theupper actuators (342).

The upper connector arms (340) are rocker arms that connect between theupper keys (338) and the upper actuators (342). The upper connector arms(340) are weighted to be biased to push the upper keys (338) downtowards the lower plate assembly (344).

The upper actuators (342) provide the force to move the keys (338). Inone embodiment, the upper actuators (342) are pneumatic cylinders.

The lower plate assembly (344) is adjacent to the upper plate assembly(330). The lower plate assembly (344) includes the lower key assembly(346).

Turning to FIG. 3B, a perspective view of the fiber organizer system(300) is illustrated showing the upper and lower key assemblies (336)and (346). The lower keys (348) of the lower key assembly (346) areconnected through the lower connector arms (350) to the actuators (352).The lower connector arms (350) are weighted to be biased to pull thelower keys (348) down and away form the upper plate assembly (332). Thelower actuators (352) provide the force to move the lower keys (348).

The upper key assembly (336) includes the upper key pin (356), the upperkey cover (358). The upper keys (338) rotate about the upper key pin(356). The upper key cover (358) supports the upper key pin (356).

The upper connector arms (340) include two opposing sets of connectorarms that transfer forces from two opposing sets of actuators of theupper actuators (342). The upper connector arms (340) rotate about theupper connector pins (358) that are supported by the upper pin housings(360).

Turning to FIG. 3C, a front view of the fiber organizer system (300) isillustrated showing the upper and lower plate assemblies (332) and(344). The upper and lower plate assemblies (332) and (344) respectivelyinclude the upper and lower plates (334) and (354) and the upper andlower key assemblies (336) and (346). The upper and lower plates (334)and (354) are offset from each other by about the combined width of theupper keys (338) of the upper key assembly (336). The combined width ofthe upper keys (338) is about equal to the combined width of the lowerkeys (348).

Turning to FIG. 3D, a perspective view of the fiber organizer system(300) is illustrated showing a cross section of the fiber organizersystem (300) along the key (362). Movement of the key (362) (as well asthe other upper keys (338) of FIG. 3C) is limited by the upper insert(364).

The upper connector arm (366) connects to the key (362) at the actuatorhole (368) to transfer force from the upper actuator (372). The passthrough holes (370) allow the remaining upper connector arms (340) topass through the key (362) without transferring forces from the otherupper actuators (342).

Turning to FIG. 3E, a zoomed perspective view of the fiber organizersystem (300) is illustrated showing a cross section of the fiberorganizer system (300) along the key (362). Movement of the key (362) islimited by interaction of the upper and lower surfaces (382) and (383)of the key (362) with the upper and lower surfaces (384) and (385) ofthe insert (364).

Turning to FIG. 3F, a perspective view of the upper key (374) (of theupper keys (338) of FIG. 3C) is illustrated. The upper key (374)includes the pivot hole (376), the pass through holes (378), and theactuator hole (380). The upper surface (386) limits downward motion ofthe key (374) and the lower surface (387) limits upward motion of thekey (374).

FIGS. 4A and 4N show the initial and subsequent images (400) and (480)with the initial and subsequent sequences of the fibers A (402), B(404), C (406), and D (408). FIGS. 4B through 4M show the movement ofthe fibers A (402) through D (408) between the first and secondassemblies A 4XX and B 4XX.

Turning to FIG. 4A, the initial image (400) shows the initial sequenceof the fibers A (402) through D (408). The initial sequence is “D, B, C,A”, which is to be reorganized to the predetermined sequence of “A, B,C, D”. The table below shows the initial sequence of the fibers A (402)through D (408), the predetermined sequence to which the fibers A (402)through D (408) are to be organized, the upper keys that correspond tothe predetermined sequence, the lower keys that correspond to thepredetermined sequence, and the key combinations that combine the upperand lower keys for the predetermined sequence.

Initial Predetermined Upper Lower Key Sequence Sequence Key KeyCombination D A D 428 E 432 D (428), E 432 B B B 424 F 434 B (424), F434 C C C 426 G 436 C (426), G 436 A D A 422 H 438 A (422) H 438

Turning to FIG. 4B, the plate assembly A (410) includes the key assemblyA (412). The key assembly A (412) includes the keys A (422), B (424), C(426), and D (428). The plate assembly B (416) includes the key assemblyB (418). The key assembly B (418) includes the keys E (432), F (434), G(436), and H (438). The plate assembly A (410) (and all of itscomponents) slide in the direction (450) with respect to the plateassembly B (416).

Turning to FIG. 4C, the fiber A (402) is juxtaposed between the alignedcombination of keys D (428) and E (432). Responsive to the alignment ofthe key combination, the keys D (428) and E (432) are actuated to movethe fiber A (402) in the direction (452) from the plate assembly A (410)(and the key assembly A (412)) to the plate assembly B (416) (and thekey assembly B (418)).

Turning to FIG. 4D, the fiber A (402) has been transferred to the plateassembly B (416). The plate assembly A (410) continues to move in thedirection (450) with respect to the plate assembly B (416).

Turning to FIG. 4E, none of the keys A (422) through C (426) are alignedwith the keys F (434) through H (438). The plate assembly A (410)continues to move in the direction (450) with respect to the plateassembly B (416).

Turning to FIG. 4F, the key C (426) is aligned with the key F (434) butis not one of the key combinations for generating the predeterminedsequence. The plate assembly A (410) continues to move in the direction(450) with respect to the plate assembly B (416).

Turning to FIG. 4G, the keys B (424) and C (426) are respectivelyaligned with the keys F (434) and G (436). These two key combinationsare actuated to transfer the fibers B (404) and C (406) in the direction(452) from the plate assembly A (410) to the plate assembly B (416).

Turning to FIG. 4H, the fibers B (404) and C (406) have as beentransferred to the plate assembly B (416). The plate assembly A (410)continues to move in the direction (450) with respect to the plateassembly B (416).

Turning to FIGS. 4I and 4J, the key A (422) is not aligned with the keyH (438). The plate assembly A (410) continues to move in the direction(450) with respect to the plate assembly B (416).

Turning to FIG. 4K, the key A (422) is aligned with the key H (438).Responsive to the alignment of the key combination, the keys A (422) andH (438) are actuated to move the fiber D (408) in the direction (452)from the plate assembly A (410) (and the key assembly (412)) to theplate assembly B (416) (and the key assembly B (418)).

Turning to FIG. 4L, the fiber D (408) has been transferred to the plateassembly B (416). The plate assembly A (410) continues to move in thedirection (450) with respect to the plate assembly B (416).

Turning to FIG. 4M, the fibers A (402) through D (408) are in asubsequent sequence that matches the predetermined sequence. Movement ofthe plate assembly A (410) with respect to the plate assembly B (416) iscomplete.

Turning to FIG. 4N, the subsequent image (480) captures the positionsand sequence of the fibers A (402) through D (408). The sequence of thefibers A (402) through D (408) matches with the predetermined sequence“A, B, C, D”.

Embodiments of the invention may be implemented on a computing system.Any combination of a mobile, a desktop, a server, a router, a switch, anembedded device, or other types of hardware may be used. For example, asshown in FIG. 5A, the computing system (500) may include one or morecomputer processor(s) (502), non-persistent storage (504) (e.g.,volatile memory, such as a random access memory (RAM), cache memory),persistent storage (506) (e.g., a hard disk, an optical drive such as acompact disk (CD) drive or a digital versatile disk (DVD) drive, a flashmemory, etc.), a communication interface (512) (e.g., Bluetoothinterface, infrared interface, network interface, optical interface,etc.), and numerous other elements and functionalities.

The computer processor(s) (502) may be an integrated circuit forprocessing instructions. For example, the computer processor(s) (502)may be one or more cores or micro-cores of a processor. The computingsystem (500) may also include one or more input device(s) (510), such asa touchscreen, a keyboard, a mouse, a microphone, a touchpad, anelectronic pen, or any other type of input device.

The communication interface (512) may include an integrated circuit forconnecting the computing system (500) to a network (not shown) (e.g., alocal area network (LAN), a wide area network (WAN) such as theInternet, a mobile network, or any other type of network) and/or toanother device, such as another computing device.

Further, the computing system (500) may include one or more outputdevice(s) (508), such as a screen (e.g., a liquid crystal display (LCD),a plasma display, a touchscreen, a cathode ray tube (CRT) monitor, aprojector, or other display device), a printer, an external storage, orany other output device. One or more of the output device(s) (508) maybe the same or different from the input device(s) (510). The input andoutput device(s) (510 and (508)) may be locally or remotely connected tothe computer processor(s) (502), non-persistent storage (504), andpersistent storage (506). Many different types of computing systemsexist, and the aforementioned input and output device(s) (510 and (508))may take other forms.

Software instructions in the form of computer readable program code toperform embodiments of the invention may be stored, in whole or in part,temporarily or permanently, on a non-transitory computer readable mediumsuch as a CD, a DVD, a storage device, a diskette, a tape, flash memory,physical memory, or any other computer readable storage medium.Specifically, the software instructions may correspond to computerreadable program code that, when executed by a processor(s), isconfigured to perform one or more embodiments of the invention.

The computing system (500) in FIG. 5A may be connected to or be a partof a network. For example, as shown in FIG. 5B, the network (520) mayinclude multiple nodes (e.g., node X (522), node Y (524)). Each node maycorrespond to a computing system, such as the computing system (500)shown in FIG. 5A, or a group of nodes combined may correspond to thecomputing system (500) shown in FIG. 5A. By way of an example,embodiments of the invention may be implemented on a node of adistributed system that is connected to other nodes. By way of anotherexample, embodiments of the invention may be implemented on adistributed computing system having multiple nodes, where each portionof the invention may be located on a different node within thedistributed computing system. Further, one or more elements of theaforementioned computing system (500) may be located at a remotelocation and connected to the other elements over a network.

Although not shown in FIG. 5B, the node may correspond to a blade in aserver chassis that is connected to other nodes via a backplane. By wayof another example, the node may correspond to a server in a datacenter. By way of another example, the node may correspond to a computerprocessor or micro-core of a computer processor with shared memoryand/or resources.

The nodes (e.g., node X (522), node Y (524)) in the network (520) may beconfigured to provide services for a client device (526). For example,the nodes may be part of a cloud computing system. The nodes may includefunctionality to receive requests from the client device (526) andtransmit responses to the client device (526). The client device (526)may be a computing system, such as the computing system (500) shown inFIG. 5A. Further, the client device (526), as shown in FIG. 5B, mayinclude and/or perform all or a portion of one or more embodiments ofthe invention.

The computing system (500) or group of computing systems described inFIGS. 5A and 5B may include functionality to perform a variety ofoperations disclosed herein. For example, the computing system(s) mayperform communication between processes on the same or different system.A variety of mechanisms, employing some form of active or passivecommunication, may facilitate the exchange of data between processes onthe same device. Examples representative of these inter-processcommunications include, but are not limited to, the implementation of afile, a signal, a socket, a message queue, a pipeline, a semaphore,shared memory, message passing, and a memory-mapped file. Furtherdetails pertaining to a couple of these non-limiting examples areprovided below.

Based on the client-server networking model, sockets may serve asinterfaces or communication channel end-points enabling bidirectionaldata transfer between processes on the same device. Foremost, followingthe client-server networking model, a server process (e.g., a processthat provides data) may create a first socket object. Next, the serverprocess binds the first socket object, thereby associating the firstsocket object with a unique name and/or address. After creating andbinding the first socket object, the server process then waits andlistens for incoming connection requests from one or more clientprocesses (e.g., processes that seek data). At this point, when a clientprocess wishes to obtain data from a server process, the client processstarts by creating a second socket object. The client process thenproceeds to generate a connection request that includes at least thesecond socket object and the unique name and/or address associated withthe first socket object. The client process then transmits theconnection request to the server process. Depending on availability, theserver process may accept the connection request, establishing acommunication channel with the client process, or the server process,busy in handling other operations, may queue the connection request in abuffer until server process is ready. An established connection informsthe client process that communications may commence. In response, theclient process may generate a data request specifying the data that theclient process wishes to obtain. The data request is subsequentlytransmitted to the server process. Upon receiving the data request, theserver process analyzes the request and gathers the requested data.Finally, the server process then generates a reply including at leastthe requested data and transmits the reply to the client process. Thedata may be transferred, more commonly, as datagrams or a stream ofcharacters (e.g., bytes).

Shared memory refers to the allocation of virtual memory space in orderto substantiate a mechanism for which data may be communicated and/oraccessed by multiple processes. In implementing shared memory, aninitializing process first creates a shareable segment in persistent ornon-persistent storage. Post creation, the initializing process thenmounts the shareable segment, subsequently mapping the shareable segmentinto the address space associated with the initializing process.Following the mounting, the initializing process proceeds to identifyand grant access permission to one or more authorized processes that mayalso write and read data to and from the shareable segment. Changes madeto the data in the shareable segment by one process may immediatelyaffect other processes, which are also linked to the shareable segment.Further, when one of the authorized processes accesses the shareablesegment, the shareable segment maps to the address space of thatauthorized process. Often, only one authorized process may mount theshareable segment, other than the initializing process, at any giventime.

Other techniques may be used to share data, such as the various datadescribed in the present application, between processes withoutdeparting from the scope of the invention. The processes may be part ofthe same or different application and may execute on the same ordifferent computing system.

Rather than or in addition to sharing data between processes, thecomputing system performing one or more embodiments of the invention mayinclude functionality to receive data from a user. For example, in oneor more embodiments, a user may submit data via a graphical userinterface (GUI) on the user device. Data may be submitted via thegraphical user interface by a user selecting one or more graphical userinterface widgets or inserting text and other data into graphical userinterface widgets using a touchpad, a keyboard, a mouse, or any otherinput device. In response to selecting a particular item, informationregarding the particular item may be obtained from persistent ornon-persistent storage by the computer processor. Upon selection of theitem by the user, the contents of the obtained data regarding theparticular item may be displayed on the user device in response to theuser's selection.

By way of another example, a request to obtain data regarding theparticular item may be sent to a server operatively connected to theuser device through a network. For example, the user may select auniform resource locator (URL) link within a web client of the userdevice, thereby initiating a Hypertext Transfer Protocol (HTTP) or otherprotocol request being sent to the network host associated with the URL.In response to the request, the server may extract the data regardingthe particular selected item and send the data to the device thatinitiated the request. Once the user device has received the dataregarding the particular item, the contents of the received dataregarding the particular item may be displayed on the user device inresponse to the user's selection. Further to the above example, the datareceived from the server after selecting the URL link may provide a webpage in Hyper Text Markup Language (HTML) that may be rendered by theweb client and displayed on the user device.

Once data is obtained, such as by using techniques described above orfrom storage, the computing system, in performing one or moreembodiments of the invention, may extract one or more data items fromthe obtained data. For example, the extraction may be performed asfollows by the computing system (500) in FIG. 5A. First, the organizingpattern (e.g., grammar, schema, layout) of the data is determined, whichmay be based on one or more of the following: position (e.g., bit orcolumn position, Nth token in a data stream, etc.), attribute (where theattribute is associated with one or more values), or a hierarchical/treestructure (consisting of layers of nodes at different levels ofdetail-such as in nested packet headers or nested document sections).Then, the raw, unprocessed stream of data symbols is parsed, in thecontext of the organizing pattern, into a stream (or layered structure)of tokens (where each token may have an associated token “type”).

Next, extraction criteria are used to extract one or more data itemsfrom the token stream or structure, where the extraction criteria areprocessed according to the organizing pattern to extract one or moretokens (or nodes from a layered structure). For position-based data, thetoken(s) at the position(s) identified by the extraction criteria areextracted. For attribute/value-based data, the token(s) and/or node(s)associated with the attribute(s) satisfying the extraction criteria areextracted. For hierarchical/layered data, the token(s) associated withthe node(s) matching the extraction criteria are extracted. Theextraction criteria may be as simple as an identifier string or may be aquery presented to a structured data repository (where the datarepository may be organized according to a database schema or dataformat, such as XML).

The extracted data may be used for further processing by the computingsystem. For example, the computing system (500) of FIG. 5A, whileperforming one or more embodiments of the invention, may perform datacomparison. Data comparison may be used to compare two or more datavalues (e.g., A, B). For example, one or more embodiments may determinewhether A>B, A=B, A !=B, A<B, etc. The comparison may be performed bysubmitting A, B, and an opcode specifying an operation related to thecomparison into an arithmetic logic unit (ALU) (i.e., circuitry thatperforms arithmetic and/or bitwise logical operations on the two datavalues). The ALU outputs the numerical result of the operation and/orone or more status flags related to the numerical result. For example,the status flags may indicate whether the numerical result is a positivenumber, a negative number, zero, etc. By selecting the proper opcode andthen reading the numerical results and/or status flags, the comparisonmay be executed. For example, in order to determine if A>B, B may besubtracted from A (i.e., A−B), and the status flags may be read todetermine if the result is positive (i.e., if A>B, then A—B>0). In oneor more embodiments, B may be considered a threshold, and A is deemed tosatisfy the threshold if A=B or if A>B, as determined using the ALU. Inone or more embodiments of the invention, A and B may be vectors, andcomparing A with B requires comparing the first element of vector A withthe first element of vector B, the second element of vector A with thesecond element of vector B, etc. In one or more embodiments, if A and Bare strings, the binary values of the strings may be compared.

The computing system (500) in FIG. 5A may implement and/or be connectedto a data repository. For example, one type of data repository is adatabase. A database is a collection of information configured for easeof data retrieval, modification, re-organization, and deletion. ADatabase Management System (DBMS) is a software application thatprovides an interface for users to define, create, query, update, oradminister databases.

The user, or software application, may submit a statement or query intothe DBMS. Then the DBMS interprets the statement. The statement may be aselect statement to request information, update statement, createstatement, delete statement, etc. Moreover, the statement may includeparameters that specify data, or data container (database, table,record, column, view, etc.), identifier(s), conditions (comparisonoperators), functions (e.g., join, full join, count, average, etc.),sort (e.g., ascending, descending), or others. The DBMS may execute thestatement. For example, the DBMS may access a memory buffer, a referenceor index a file for read, write, deletion, or any combination thereof,for responding to the statement. The DBMS may load the data frompersistent or non-persistent storage and perform computations to respondto the query. The DBMS may return the result(s) to the user or softwareapplication.

The computing system (500) of FIG. 5A may include functionality topresent raw and/or processed data, such as results of comparisons andother processing. For example, presenting data may be accomplishedthrough various presenting methods. Specifically, data may be presentedthrough a user interface provided by a computing device. The userinterface may include a GUI that displays information on a displaydevice, such as a computer monitor or a touchscreen on a handheldcomputer device. The GUI may include various GUI widgets that organizewhat data is shown as well as how data is presented to a user.Furthermore, the GUI may present data directly to the user, e.g., datapresented as actual data values through text, or rendered by thecomputing device into a visual representation of the data, such asthrough visualizing a data model.

For example, a GUI may first obtain a notification from a softwareapplication requesting that a particular data object be presented withinthe GUI. Next, the GUI may determine a data object type associated withthe particular data object, e.g., by obtaining data from a dataattribute within the data object that identifies the data object type.Then, the GUI may determine any rules designated for displaying thatdata object type, e.g., rules specified by a software framework for adata object class or according to any local parameters defined by theGUI for presenting that data object type. Finally, the GUI may obtaindata values from the particular data object and render a visualrepresentation of the data values within a display device according tothe designated rules for that data object type.

Data may also be presented through various audio methods. In particular,data may be rendered into an audio format and presented as sound throughone or more speakers operably connected to a computing device.

Data may also be presented to a user through haptic methods. Forexample, haptic methods may include vibrations or other physical signalsgenerated by the computing system. For example, data may be presented toa user using a vibration generated by a handheld computer device with apredefined duration and intensity of the vibration to communicate thedata.

The above description of functions presents only a few examples offunctions performed by the computing system (500) of FIG. 5A and thenodes (e.g., node X (522), node Y (524)) and/or client device (526) inFIG. 5B. Other functions may be performed using one or more embodimentsof the invention.

While the invention has been described with respect to a limited numberof embodiments, those skilled in the art, having benefit of thisdisclosure, will appreciate that other embodiments can be devised whichdo not depart from the scope of the invention as disclosed herein.Accordingly, the scope of the invention should be limited only by theattached claims.

What is claimed is:
 1. A method comprising: receiving a plurality offibers into a first assembly; obtaining an initial sequence of theplurality of fibers in the first assembly; identifying a set of keycombinations from the initial sequence and a predetermined sequence;sliding a second assembly across the first assembly; and actuating theset of key combinations to move the plurality of fibers from the firstassembly to the second assembly and order the plurality of fibers in thesecond assembly in the predetermined sequence.
 2. The method of claim 1,further comprising: identifying a key combination from the set of keycombinations comprising a first key from the first assembly and a secondkey from the second assembly.
 3. The method of claim 1, furthercomprising: actuating a key combination to move a fiber of the pluralityof fibers from the first assembly to the second assembly and place thefiber into the second assembly in accordance with the predeterminedsequence.
 4. The method of claim 1, further comprising: actuating, basedon a position of the first assembly with respect to the second assembly,a first key from the first assembly and a second key from the secondassembly to move a fiber of the plurality of fibers from the firstassembly to the second assembly.
 5. The method of claim 1, furthercomprising: imaging the plurality of fibers extending from the firstassembly, before sliding the second assembly, to generate an initialimage; and identifying the set of key combinations using the initialimage.
 6. The method of claim 1, further comprising: imaging theplurality of fibers extending from the second assembly, after slidingthe second assembly, to generate a subsequent image; determining asubsequent sequence of the plurality of fibers from the subsequentimage; and verifying the subsequent sequence with the predeterminedsequence using the subsequent image.
 7. The method of claim 1, furthercomprising: training a machine learning model to generate a predictionof a training order of training fibers in response to a trainingcarriage speed, a training key speed, a training fiber order, and atraining cycle time.
 8. The method of claim 1, further comprising:selecting a carriage speed for the sliding and a key speed for theactuating using a machine learning model, the initial sequence, and anumber of machine cycles.
 9. The method of claim 1, wherein a key widthof a first key of the first set of keys and of a second key of thesecond set of keys is about equal to a fiber diameter of a fiber of theplurality of fibers.
 10. The method of claim 1, further comprising:limiting movement of a key of the first assembly with an insert to aplate of the first assembly.
 11. A fiber sorting system comprising: afirst assembly; a second assembly; a computing system; and a controlapplication; the control application executing on the computing systemand configuring the fiber sorting system for: obtaining an initialsequence of a plurality of fibers in the first assembly; identifying aset of key combinations from the initial sequence and a predeterminedsequence; sliding the second assembly across the first assembly; andactuating the set of key combinations to move the plurality of fibersfrom the first assembly to the second assembly and order the pluralityof fibers in the second assembly in the predetermined sequence.
 12. Thesystem of claim 11, wherein the control application is furtherconfigured for: identifying a key combination from the set of keycombinations comprising a first key from the first assembly and a secondkey from the second assembly.
 13. The system of claim 11, wherein thecontrol application is further configured for: actuating a keycombination to move a fiber of the plurality of fibers from the firstassembly to the second assembly and place the fiber into the secondassembly in accordance with the predetermined sequence.
 14. The systemof claim 11, wherein the control application is further configured for:actuating, based on a position of the first assembly with respect to thesecond assembly, a first key from the first assembly and a second keyfrom the second assembly to move a fiber of the plurality of fibers fromthe first assembly to the second assembly.
 15. The system of claim 11,wherein the control application is further configured for: imaging theplurality of fibers extending from the first assembly, before slidingthe second assembly, to generate an initial image; and identifying theset of key combinations using the initial image.
 16. The system of claim11, wherein the control application is further configured for: imagingthe plurality of fibers extending from the second assembly, aftersliding the second assembly, to generate a subsequent image; determininga subsequent sequence of the plurality of fibers from the subsequentimage; and verifying the subsequent sequence with the predeterminedsequence using the subsequent image.
 17. The system of claim 11, furthercomprising: a training application executing on the computing system andconfigured for: training a machine learning model to generate aprediction of a training order of training fibers in response to atraining carriage speed, a training key speed, a training fiber order,and a training cycle time.
 18. The system of claim 11, wherein thecontrol application is further configured for: selecting a carriagespeed for the sliding and a key speed for the actuating using a machinelearning model, the initial sequence, and a number of machine cycles.19. The system of claim 11, wherein a key width of a first key of thefirst set of keys and of a second key of the second set of keys is aboutequal to a fiber diameter of a fiber of the plurality of fibers.
 20. Afiber sorting system comprising: a first assembly; an insert; a plate ofthe first assembly comprising the insert; a second assembly; a computingsystem; and a control application; the control application executing onthe computing system and configuring the fiber sorting system for:obtaining an initial sequence of a plurality of fibers in the firstassembly; identifying a set of key combinations from the initialsequence and a predetermined sequence; sliding the second assemblyacross the first assembly; actuating the set of key combinations to movethe plurality of fibers from the first assembly to the second assemblyand order the plurality of fibers in the second assembly in thepredetermined sequence; and limiting movement of a key of the firstassembly with an insert to the plate of a first assembly.